In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact: "either it will or will not be a match.

1. A function is defined to take arguments of a particular type, form or value. When applying the function to its actual arguments it is necessary to match the type, form or value of the actual arguments against the formal arguments in some definition. For example, the function length [] = 0 length (x:xs) = 1 + length xs uses pattern matching in its argument to distinguish a null list from a non-null one. There are well known algorithm for translating pattern matching into conditional expressions such as "if" or "case". E.g. the above function could be transformed to length l = case l of [] -> 0 x:xs -> 1 : length xs Pattern matching is usually performed in textual order though there are languages which match more specific patterns before less specific ones. 2. Descriptive of a type of language or utility such as awk or Perl which is suited to searching for strings or patterns in input data, usually using some kind of {regular expression}. (1994-11-28)

Gestalt Pattern Matching, also Ratcliff/Obershelp Pattern Recognition, is a string-matching algorithm for determining the similarity of two strings. It was developed in 1983 by John W.

In computer science, compressed pattern matching (abbreviated as CPM) is the process of searching for patterns in compressed data with little or no decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space.

Bracket matching, also known as brace matching or parentheses matching, is a syntax highlighting feature of certain text editors and integrated development environments that highlights matching sets of brackets (square brackets, curly brackets, or parentheses) in languages such as Java, JavaScript, and C++ that use them. The purpose is to help the programmer navigate through the code and also spot any improper matching, which would cause the program to not compile or malfunction.

In economics, matching theory, also known as search and matching theory, is a mathematical framework attempting to describe the formation of mutually beneficial relationships over time.

In economics, search and matching theory, is a mathematical framework attempting to describe the formation of mutually beneficial relationships over time. It is closely related to stable matching theory.

In casting, a pattern is a replica of the object to be cast, used to prepare the cavity into which molten material will be poured during the casting process.

Matching funds are funds that are set to be paid in proportion to funds available from other sources. Matching fund payments usually arise in situations of charity or public good.

In sewing and fashion design, a pattern is the template from which the parts of a garment are traced onto woven or knitted fabrics before being cut out and assembled. Patterns are usually made of paper, and are sometimes made of sturdier materials like paperboard or cardboard if they need to be more robust to withstand repeated use.